Perturbations for Delaunay and weighted Delaunay 3D triangulations
نویسندگان
چکیده
منابع مشابه
Perturbations for Delaunay and weighted Delaunay 3D triangulations
The Delaunay triangulation and the weighted Delaunay triangulation are not uniquely defined when the input set is degenerate. We present a new symbolic perturbation that allows to always define these triangulations in a unique way, as soon as the points are not all coplanar. No flat tetrahedron exists in the defined triangulation. The perturbation scheme is easy to code; It is implemented in cg...
متن کاملA Monotonicity Property for Weighted Delaunay Triangulations
where i is the linear interpolation of f over the triangle Ti in T and the sum is over all triangles in the triangulation. One may consider changing the triangulation by exchanging two triangles joined by an edge, forming a quadrilateral, by the triangles obtained by switching the diagonal of the quadrilateral; this is called an edge ip or a 2 ! 2 bistellar ip. He showed that the roughness of...
متن کاملVertex Deletion for 3D Delaunay Triangulations
We show how to delete a vertex q from a three-dimensional Delaunay triangulation DT(S) in expected O(C⊗(P )) time, where P is the set of vertices neighboring q in DT(S) and C⊗(P ) is an upper bound on the expected number of tetrahedra whose circumspheres enclose q that are created during the randomized incremental construction of DT(P ). Experiments show that our approach is significantly faste...
متن کاملA Variational Principle for Weighted Delaunay Triangulations and Hyperideal Polyhedra
We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with one vertex on and the remaining vertices beyond the infinite boundary of hype...
متن کاملDelaunay Triangulations for Moving Points
This paper considers the problem of updating efficiently a Delaunay triangulation when vertices are moving under small perturbations. Its main contribution is a set of algorithms based on the concept of vertex tolerance. Experiment shows that it is able to outperform the naive rebuilding algorithm in certain conditions. For instance, when points, in two dimensions, are relocated by Lloyd’s iter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2011
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2010.09.010